Time-limited polling systems with batch arrivals and phase-type service times
نویسندگان
چکیده
منابع مشابه
Time-limited polling systems with batch arrivals and phase-type service times
In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the que...
متن کاملAnalysis of threshold-based batch-service queueing systems with batch arrivals and general service times
Most research concerning batch-service queueing systems has focussed on some specific aspect of the buffer content. Further, the customer delay has only been examined in the case of single arrivals. In this paper, we examine three facets of a threshold-based batch-service system with batch arrivals and general service times. First, we compute a fundamental formula from which an entire gamut of ...
متن کاملInfinite-server Queues with Batch Arrivals and Dependent Service Times
Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time-varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within...
متن کاملPolling with batch service
This paper considers a batch service polling system. We first study the case in which the server visits the queues cyclically, considering three different service regimes: gated, exhaustive, and globally gated. We subsequently analyze the case (the so called ‘Israeli Queue’) in which the server first visits the queue with the ‘oldest’ customer. In both cases, queue lengths and waiting times are...
متن کاملCritically loaded k-limited polling systems with switch-over times
We consider a two-queue polling model with switch-over times and k-limited service (serve at most k i customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it-besides bounding the cycle time-effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2011
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-011-0846-y